A theoretical limit for safety verification techniques with regular fix-point computations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Project Proposal Theoretical Adverse Computations , and Safety

Theoretical Adverse Computations, and Safety ThEorie des Calculs AdveRses, et sécurité CARTE Scientific leader: Jean-Yves Marion INRIA scientific and technological challenges: 1 3 and 1 1 The seven INRIA scientific and technological challenges are: 1. Designing and mastering the future network and communication services infrastructures 2. Developing multimedia data and information processing 3....

متن کامل

Effect of different yield functions on computations of forming limit curves for aluminum alloy sheets

In this article, the effect of different yield functions on prediction of forming limit curve (FLC) for aluminum sheet is studied. Due to importance of FLC in sheet metal forming, concentration on effective parameters must be considered exactly in order to have better theoretical prediction comparing experimental results. Yield function is one of the factors which are improved by adding new coe...

متن کامل

A theoretical basis for efficient computations with noisy spiking neurons

Network of neurons in the brain apply – unlike processors in our current generation of computer hardware – an event-based processing strategy, where short pulses (spikes) are emitted sparsely by neurons to signal the occurrence of an event at a particular point in time. Such spike-based computations promise to be substantially more power-efficient than traditional clocked processing schemes. Ho...

متن کامل

New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic

This paper introduces a new higher-order typed constructive predicate logic for fixpoint computations, which exploits the categorical semantics of computations introduced by Moggi [Mog 89] and contains a version of Martin Löf’s ‘iteration type’ [MarL 83]. The type system enforces a separation of computations from values. The logic contains a novel form of fixpoint induction and can express part...

متن کامل

Fix Point Theorem for Compact Spaces

The articles [10], [11], [1], [5], [8], [7], [12], [3], [9], [4], [2], and [6] provide the notation and terminology for this paper. In this paper M denotes a non empty metric space. One can prove the following proposition (1) Let F be a set. Suppose F is finite and F 6= / 0 and F is ⊆-linear. Then there exists a set m such that m ∈ F and for every set C such that C ∈ F holds m⊆C. Let M be a non...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2008

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2008.03.012